Addressing State Explosion in Behavior Protocol Verification
نویسندگان
چکیده
A typical problem formal verification faces is the size of the model of a system being verified. Even for a small system, the state space of the model tends to grow exponentially (state explosion). In this paper, we present a new representation of state spaces suitable for implementing operations upon behavior protocols of software components [1]. The proposed representation is linear in length of the source behavior protocol. By trading space for time, it allows handling behavior protocols of “practical size”. As a proof of concept, a verification tool for behavior protocols is discussed.
منابع مشابه
Formal Verification of Components in Java
Title: Formal Verification of Components in Java Author: Pavel Paŕızek email: [email protected] phone: +420 2 2191 4235 Department: Department of Software Engineering Faculty of Mathematics and Physics Charles University in Prague, Czech Republic Advisor: Prof. Frantǐsek Plášil email: [email protected] phone: +420 2 2191 4266 Mailing address (both Author and Advisor): Dept. of SW E...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملBehavior Protocols Verification: Fighting State Explosion
A typical problem formal verification faces is the size of the model of a system being verified. Even for a small system, the state space of the model tends to grow exponentially (state explosion). In this paper, we present a new representation of state spaces suitable for implementing operations upon behavior protocols of software components [1]. The proposed representation is linear in length...
متن کاملDeadlock Detection in CFSM Models via Simultaneously Executable Sets
Reachability analysis is an extensively used technique in many areas such as protocol verification and concurrent program verification. The main limitation of this technique is its exponential complexity, i.e., the state explosion problem. The major contributor to the state explosion problem has been known as concurrency. Rather than examining all possible interleavings of concurrent behavior d...
متن کاملPerformance Improvements of Behavior Protocol Checking
One of the serious problems of model checking is the state explosion problem. It hinders the use of model checking methods as everyday debugging tool. Using behavior protocol as a component specification mechanism also yields this problem. As the component compatibility verification using behavior protocols is based on exhaustive state space traversing, the enormous size of the state space in s...
متن کامل